Choosing the best logk(N, m, P) strictly nonblocking networks
نویسنده
چکیده
We extend the log 2 (N; m; P ) network proposed by Shyy and Lea to base k. We give a unifying proof (instead of three separate cases as done by Shyy and Lea) for the condition of being strictly nonblocking, and a simpler expression of the result. We compare the number of crosspoints for log k (N; m; p) over various k.
منابع مشابه
Strictly nonblocking conference networks using high-dimensional meshes
This paper introduces a conferencing server design based on an innovative configurable computing architecture to support the information transmission and distributed processing associated with creating and maintaining simultaneous disjoint conferences among sets of N conferees, where rdimensional meshes can be used as the conferencing components. An r-dimensional conferencing mesh network is st...
متن کاملWide-Sense Nonblocking Clos Networks under Packing Strategy
In this paper, we study wide-sense nonblocking conditions under packing strategy for the three-stage Clos network, or v(m;n; r) network. Wide-sense nonblocking networks are generally believed to have lower network cost than strictly nonblocking networks. However, the analysis for the wide-sense nonblocking conditions is usually more difficult. Moore[2] proved that a v(m;n; 2) network is nonbloc...
متن کاملVirtual Nonblocking Switching Networks
Nonblocking networks are always favored to be used as switching networks whenever possible. There are three types of nonblocking networks, namely rearrangeable nonblocking networks, wide-sense nonblocking networks, and strictly nonblocking networks. Large-scale wide-sense nonblocking networks and strictly nonblocking networks may be infeasible due to their high cost. In contrast, rearrangeable ...
متن کاملEfficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems
AbsfructThe performance of a multiprocessor system depends heavily on its ability to provide conflict free paths among its processors. In this paper, we explore the possibility of using a nonblocking network with O ( N log N ) edges (crosspoints) to interconnect the processors of an N processor system. We combine Bassalygo and Pinsker's implicit design of strictly nonblocking networks with an e...
متن کاملExtended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
Since Clos gave the first construction of a strictly nonblocking multistage interconnection network, only a few other constructions have been proposed in almost a half-century. In this paper, we introduce a constructive class of networks which utilizes crossbars of virtually any size and for which the sizes can vary from stage to stage. The interconnection between stages is a generalized shuffl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 46 شماره
صفحات -
تاریخ انتشار 1998